The Integer Arithmetic of Legislative Dynamics
نویسندگان
چکیده
Every legislature may be defined by a finite integer partition of legislative seats between parties and a winning vote quota defining the minimum coalition size required to pass decisions. In this paper we explore the finite set of integer partitions of legislatures, categorizing all legislatures as one of five basic types. As legislatures approach the partition thresholds between these categories, they approach the thresholds for changing the set of winning coalitions. The criteria defining such partitions of legislatures thus define important thresholds for shifting the legislature from one bargaining environment to another. These different bargaining environments will generate different bargaining expectations for at least some of the set of parties, which in turn may create incentives for defections of legislators from one party to another, in order to shift the legislature from one bargaining environment to another and thereby create a gain in bargaining expectations for the switching legislator and the party to which she defects. The paper proceeds in five parts. First, we develop a theoretical categorization of legislatures into those likely a priori to have different bargaining environments. Second, we analyze the role of a particular type of party that is especially privileged under particular integer partitions of a legislature, which we call a k-dominant party. Third, we examine the category frequencies and partition characteristics in a “metadata” set that contains to universe of all logically possible integer partitions of seats between up to ten parties in a 100-seat legislature. Fourth, we examine similar patterns in real legislatures, linking the categories to outcomes such as control of the prime minister and single-party minority government. Finally, we explore the extent to which all of this helps us to explain party switching by individual legislators. ∗ Prepared for presentation at the Workshop on Party Switching, July 10-14, 2005, University of Virginia, Charlottesville, Va. With heartfelt thanks to Macartan Humphries for invaluable comments on an earlier draft. Integer arithmetic of legislative dynamics / 2
منابع مشابه
Self-similar fractals and arithmetic dynamics
The concept of self-similarity on subsets of algebraic varieties is defined by considering algebraic endomorphisms of the variety as `similarity' maps. Self-similar fractals are subsets of algebraic varieties which can be written as a finite and disjoint union of `similar' copies. Fractals provide a framework in which, one can unite some results and conjectures in Diophantine g...
متن کاملAIOSC: Analytical Integer Word-length Optimization based on System Characteristics for Recursive Fixed-point LTI Systems
The integer word-length optimization known as range analysis (RA) of the fixed-point designs is a challenging problem in high level synthesis and optimization of linear-time-invariant (LTI) systems. The analysis has significant effects on the resource usage, accuracy and efficiency of the final implementation, as well as the optimization time. Conventional methods in recursive LTI systems suffe...
متن کاملOverflow Detection in Residue Number System, Moduli Set {2n-1,2n,2n+1}
Residue Number System (RNS) is a non-weighted number system for integer number arithmetic, which is based on the residues of a number to a certain set of numbers called module set. The main characteristics and advantage of residue number system is reducing carry propagation in calculations. The elimination of carry propagation leads to the possibility of maximizing parallel processing and reduc...
متن کاملOn the Satisfiability of Modular Arithmetic Formula
Modular arithmetic is the underlying integer computation model in conventional programming languages. In this paper, we discuss the satisfiability problem of modular arithmetic formulae over the finite ring Z2ω . Although an upper bound of 2 2 4) can be obtained by solving alternation-free Presburger arithmetic, it is easy to see that the problem is in fact NP-complete. Further, we give an effi...
متن کاملAn Automata - Theoretic Approach toPresburger Arithmetic Constraints
This paper introduces a nite-automata based representation of Presburger arithmetic deenable sets of integer vectors. The representation consists of concurrent automata operating on the binary en-codings of the elements of the represented sets. This representation has several advantages. First, being automata-based it is operational in nature and hence leads directly to algorithms, for instance...
متن کامل